Higher order Whitehead products and Postnikov systems

On Generalized Whitehead Products

We define a symmetric monodical pairing G ◦ H among simply connected co-H spaces G and H with the property that S(G◦H) is equivalent to the smash product G∧H as co-H spaces. We further generalize the Whitehead product map to a map G ◦ H → G ∨ H whose mapping cone is the cartesian product. Whitehead products have played an important role in unstable homotopy. They were originally introduced [Whi...

Discontinuous Residue and Theme in Higher-Order Semiotic: A Case for Interlocking Systems

  The fallacy persists in discourse analysis research to explore lexicogrammatical phenomena detached from any adjacent plane of the meaning potential. In an attempt to dispel this and toss out some preconceived notions about what a modern SFG vantage point should involve, this study homes in on one aspect of SFG within prose fiction in particular, which is very revealing in terms of how separ...

Higher order indexed monadic systems

A word rewriting system is called monadic if each of its right hand sides is either a single letter or the empty word. We study the images of higher order indexed languages (defined by Maslov) under inverse derivations of infinite monadic systems. We show that the inverse derivations of deterministic level n indexed languages by confluent regular monadic systems are deterministic level n+1 lang...

Higher-order Rewrite Systems and Their Connuence

We study Higher-Order Rewrite Systems (HRSs) which extend term rewriting to-terms. HRSs can describe computations over terms with bound variables. We show that rewriting with HRSs is closely related to undirected equational reasoning. We deene Pattern Rewrite Systems (PRSs) as a special case of HRSs and extend three connuence results from term rewriting to PRSs: the critical pair lemma by Knuth...

Higher - Order Rewrite Systems and their